Elementary Modal Logics over Transitive Structures
نویسندگان
چکیده
We show that modal logic over universally first-order definable classes of transitive frames is decidable. More precisely, let K be an arbitrary class of transitive Kripke frames definable by a universal first-order sentence. We show that the global and finite global satisfiability problems of modal logic over K are decidable in NP, regardless of choice of K. We also show that the local satisfiability and the finite local satisfiability problems of modal logic over K are decidable in NExpTime. 1998 ACM Subject Classification F.4.1 Mathematical Logic
منابع مشابه
Non-primitive recursive decidability of products of modal logics with expanding domains
We show that—unlike products of ‘transitive’ modal logics which are usually undecidable— their ‘expanding domain’ relativisations can be decidable, though not in primitive recursive time. In particular, we prove the decidability and the finite expanding product model property of bimodal logics interpreted in two-dimensional structures where one component—call it the ‘flow of time’—is • a finite...
متن کاملElementary Modal Logics – Decidability and Complexity
Modal logic was first introduced by philosophers to study the deductive behaviour of the expressions it is necessary that and it is possible that. Nowadays, it is widely used in several areas of computer science, including formal verification and artificial intelligence. Syntactically, modal logic extends propositional logic by two unary operators: ♦ and . The formal semantics is usually given ...
متن کاملThe complexity of hybrid logics over restricted frame classes
This dissertation examines the computational complexity of decision problems for a collection of hybrid logics over different classes of frames. Hybrid logics are extensions of modal logic that allow, in addition to the usual perspective on states and their successors in relational structures, for naming and accessing states of a structure explicitly. These features are very desirable in many a...
متن کاملSatisfiability vs. Finite Satisfiability in Elementary Modal Logics
We study elementary modal logics, i.e. modal logic considered over first-order definable classes of frames. The classical semantics of modal logic allows infinite structures, but often practical applications require to restrict our attention to finite structures. Many decidability and undecidability results for the elementary modal logics were proved separately for general satisfiability and fo...
متن کاملComplexity of hybrid logics over transitive frames
This paper examines the complexity of hybrid logics over transitive frames and transitive trees. We show that satisfiability over transitive frames for the hybrid language extended with ↓ is NEXPcomplete. This is in contrast to undecidability of satisfiability over arbitrary frames for this language [2]. We also show that adding @ or the past modality leads to undecidability over transitive fra...
متن کامل